A priori optimization for the probabilistic maximum independent set problem
نویسندگان
چکیده
منابع مشابه
Accelerating Local Search for the Maximum Independent Set Problem
Computing high-quality independent sets quickly is an important problem in combinatorial optimization. Several recent algorithms have shown that kernelization techniques can be used to find exact maximum independent sets in medium-sized sparse graphs, as well as high-quality independent sets in huge sparse graphs that are intractable for exact (exponential-time) algorithms. However, a major dra...
متن کاملExperimental Algorithm for the Maximum Independent Set Problem
We develop an experimental algorithm of exact solving for the maximum independent set problem. The algorithm consecutively finds the maximal independent sets of vertices in an arbitrary undirected graph such that the next such set contains more elements than preceding one. For this purpose, we use a technique, developed by Ford and Fulkerson for the finite partially ordered sets, in particular,...
متن کاملFast Local Search for the Maximum Independent Set Problem
Given a graph G = (V, E), the independent set problem is that of finding a maximum-cardinality subset S of V such that no two vertices in S are adjacent. We present a fast local search routine for this problem. Our algorithm can determine in linear time if a maximal solution can be improved by replacing a single vertex with two others. We also show that an incremental version of this method can...
متن کاملUsing Critical Sets for the Maximum Independent Set Problem Solving
The problem of finding a maximum independent set in an undirected graph is a well known NP-hard problem. On the other hand, the critical independent set problem is polynomially solvable. The relationship between these two problems is studied and a method that utilizes a nonempty critical independent set for solving the maximum independent set problem is developed. The efficiency of the proposed...
متن کاملBoosting Local Search for the Maximum Independent Set Problem
An independent set of a graph G = (V, E) with vertices V and edges E is a subset S ⊆ V, such that the subgraph induced by S does not contain any edges. The goal of the maximum independent set problem (MIS problem) is to find an independent set of maximum size. It is equivalent to the well-known vertex cover problem (VC problem) and maximum clique problem. This thesis consists of two main parts....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00005-6